#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
int a[N];
int b[N];
void solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  m = 0;
  for (int i = 1, j = 1; i <= n; i = j) {
    while (j <= n && a[j] == a[i]) j++;
    b[++m] = j - i;
  }
  sort(b + 1, b + m + 1);
  int ans = 0;
  rep(i, 1, m) ans = max(ans, b[i] * (m + 1 - i));
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}